Tiered Recursion and Strategies
نویسندگان
چکیده
The purpose of this paper is to stress the need for strategies in the framework of term-rewriting analysis of complexity classes. Independently our results can be conceived as a simplification and clarification of the results obtained in [6]. In particular, we introduce a new path order ≺pop for polynomial time computable functions, such that for a finite rewrite system R compatible with ≺pop, the complexity or derivation length function DlR(n) is guaranteed to be bounded by a polynomial in n.
منابع مشابه
Impact of Differentiated Instruction Strategies and Traditional-Based Instruction on the Reading Comprehension of Iranian EFL Students
This study investigates and compares the efficacy of differentiated instruction and traditional-based instruction on enhancing Iranian students’ reading comprehension. Eight elementary, intermediate, and advanced classrooms from 1 language institute were chosen, and based on their performance on the pretests were further divided into 4 control and 4 treatment groups. Flexible grouping, tiered i...
متن کاملA Three{tiered Conndence Model for Revising Logical Theories
The task of theory revision in Inductive Logic Programming is to correct the current theory when contradictions with new examples arise. Conndence models are used to assess and compare the diierent alternatives of revising a theory in order to choose the best revision. In this paper, we propose an augmentation of the two{tiered conndence model of MOBAL/KRT that allows to combine diierent heuris...
متن کاملThe Implicit Computational Complexity of Imperative Programming Languages
During the last decade Cook, Bellantoni, Leivant and others have developed the theory of implicit computational complexity, i.e. the theory of predicative recursion, tiered definition schemes, etcetera. We extend and modify this theory to work in a context of imperative programming languages, and characterise complexity classes like P, linspace, pspace and the classes in the Grzegorczyk hiearch...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملMetacognitive processes for uncertainty handling: Connectionist implementation of a cognitive model
An empirically based cognitive model of real-world decision making was implemented in Shruti, a system capable of rapid, parallel relational reasoning. The system effectively simulates a two-tiered strategy associated with proficient decisions makers: Recognitional or reflexive activation of expectations and associated responses, accompanied by an optional, recursive process of critiquing and c...
متن کامل